Automatic design for shop scheduling strategies based on hyper-heuristics: A systematic review

Against the background of smart manufacturing and Industry 4.0, how to achieve real-time scheduling has become a problem to be solved. In this regard, automatic design for shop scheduling based on hyper-heuristics has been widely studied, and a number of reviews and scheduling algorithms have been presented. Few studies, however, have specifically discussed the technical points involved in algorithm development. This study, therefore, constructs a general framework for automatic design for shop scheduling strategies based on hyper-heuristics, and various state-of-the-art technical points in the development process are summarized. First, we summarize the existing types of shop scheduling strategies and classify them using a new classification method. Second, we summarize an automatic design algorithm for shop scheduling. Then, we investigate surrogate-assisted methods that are popular in the current algorithm field. Finally, current problems and challenges are discussed, and potential directions for future research are proposed.     

Risk of slaughterhouse workers developing work-related musculoskeletal disorders in different organizational working conditions

Job rotation is defined as workers rotating between tasks with different exposure levels and occupational demands. The aim of the present study was to analyze the risk factors for the development of upper-limb work-related musculoskeletal disorders (UL-WMSDs) in poultry slaughterhouse workers as well as compare the score of the OCRA Checklist in different organizational working conditions. In this cross-sectional study, 118 workers were involved, 68 women (32.3 ± 10.7 years) and 50 men (29.5 ± 10.5 years). Three organizational configurations (“without job rotation”, “with job rotation – tasks >1h” and “with job rotation - tasks <1h”) were evaluated using the OCRA Checklist method, totaling 36 tasks and 28 job rotation schemes composed of 2–3 tasks. The OCRA score of the right upper limbs (17.8 ± 3.2) was significantly higher (p = 0.046) relative to the left upper limbs (16.4 ± 3.6). The median score was significantly lower in the “with job rotation - tasks <1h” condition (18.6) when compared to the “job rotation – tasks >1h” (19.4) (p < 0.001) and the “without job rotation” (19.0) (p = 0.038) conditions. However, there was no significant difference between the condition “with job rotation - tasks >1h” and “without job rotation” (p = 0.155). Thus, job rotations with intervals <1h reduced the risk of developing UL-WMSDs. Job rotations with <1 h intervals in poultry slaughterhouses are recommended along with further studies to verify the effectiveness of rotations with more than two tasks, involving mild or non-repetitive tasks.     

Analysis of Distributed DDQ for QoS Router

In a packet switching network, congestion is unavoidable and affects the quality of real‐time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well‐known solutions for quality‐of‐service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.     

网格资源管理系统模型研究

网格资源管理系统是网格计算系统的重要组成部分。文章分析了网格资源管理系统的功能需求，具体论述了该模型的原型系统，最后介绍了相关研究工作。     

Putting it all together – Formal verification of the VAMP

In the verified architecture microprocessor (VAMP) project we have designed, functionally verified, and synthesized a processor with full DLX instruction set, delayed branch, Tomasulo scheduler, maskable nested precise interrupts, pipelined fully IEEE compatible dual precision floating point unit with variable latency, and separate instruction and data caches. The verification has been carried out in the theorem proving system PVS. The processor has been implemented on a Xilinx FPGA. A shorter version of this article with the title “Instantiating uninterpreted functional units and memory system: functional verification of the VAMP” appeared in [8]. The work reported here was done while all the authors were with Saarland University.     

高速分组交换网络中调度器的设计

为了满足迅猛发展的网络业务对网络服务质量提出的更高要求,使用高速分组网络交换机中的队列调度器可以有效地提供高质量的网络服务。通过采用分级式队列调度和四种队列调度算法有效地实现了队列调度器的设计。并且深入地比较和分析了队列调度器中多种队列调度算法的优缺点,尤其是对DRR调度算法进行了优化和改进。最后。对所设计的电路进行了仿真验证和电路综合,结果表明该调度器可以满足网络对服务质量的更高要求,并且能够应用到高速分组交换网络的调度器设计中。     

改进型时间触发嵌入式系统编程模式

对于成本敏感的嵌入式系统,通常因为资源有限而难以采用抢先式实时多任务操作系统。传统的基于超级循环的前后台编程方法和基于时间触发的合作式多任务编程方法对任务的划分需要较高的技巧。本文通过对基于时间触发合作式调度器的改进,建立了一种适用于小型嵌入式系统的通用编程模式,使这类系统的编程变得清晰、简单。     

A new model of job design: Initial evidence and implications for future research

Clegg and Spencer's (2007) model of job design synthesizes and extends recent conceptions of the job design process by incorporating variables such as knowledge, motivation, and trust into a cyclical and dynamic system. The objective of this study was to examine the sequential organization of variables that comprise the model, as a basis from which to justify further investigations of the model's dynamic properties. Data were collected via questionnaires from 432 participants in two work organizations. Results obtained from structural equation modeling are broadly supportive of the proposed relationships between the variables. Implications of this initial study for future research and practice are discussed. © 2011 Wiley Periodicals, Inc.     

An integrated job release and scheduling approach on parallel machines: An application in electric wire-harness industry

This paper presents a new job release (JR) and scheduling methodology for one-stage parallel machines where sequence dependent setup times exist. A decision support system (DSS) based on job release is developed in order to enable the application of the methodology. First, mathematical programming models for both job release and job scheduling are devised. Then, due to the NP-hard nature of the problems, heuristics are proposed. As for the interaction between JR and scheduling, job scheduling is integrated with job release for the proposed heuristic solutions so that the capacity achievement provided by scheduling can be utilized for job release. In brief, product design characteristics oriented scheduling affects JR in the proposed approach. Moreover, value stream mapping (VSM) approach is used with the aim of stating the effect of the proposed methodology. Furthermore, the presented methodology was applied in a real life electric wire-harness production system. The application, based on 120-day production data, revealed that the proposed methodology provided 25% decrease in in-plant manufacturing lead time.     

基于安全性能接口的调度和管理模型研究

以云计算效能提高为目的, 以研究Job调度和资源管理两大决定云计算环境能效的最重要因素为基础, 使用调度和管理对象对作为系统统计信息的参考指标进行采集的方式展开研究。性能代理和服务接口模式(PASI)已经从云环境中采集了原始数据, 通常情况下应用于云的安全技术属于被动防御模式, 如实时动态监控或者深度包检测模式(DPI), 其主要目的是实现动态检测和防御。提出了一个有效的框架以提高云计算中心的综合性能指标, 该架构的建立是基于PASI与DPI相结合的方式, 并且提出了一个基于安全PASI的Job调度和资源管理模型(JDRMSP)。实验结果表明, 该模型有效地提升了云环境的整体运作效能。